Constructing indecomposable 1-factorizations of the complete multigraph
نویسندگان
چکیده
منابع مشابه
Constructing critical indecomposable codes
Critical indecomposable codes were introduced by Assmus [1], who also gave a recursive construction for these objects. One of the key ingredients in the construction is an auxiliary code, which is an indecomposable code of minimum distance at least 3. In terms of actually being able to construct all critical indecomposable codes, however, Assmus leaves many unanswered questions about these auxi...
متن کاملConstructing Big Indecomposable Modules
Let R be local Noetherian ring of depth at least two. We prove that there are indecomposable R-modules which are free on the punctured spectrum of constant, arbitrarily large, rank.
متن کاملFair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs
A k-factor of a graph G is a k-regular spanning subgraph of G. A k-factorization is a partition of E(G) into k-factors. Let K(n, p) be the complete multipartite graph with p parts, each of size n. If V1, ..., Vp are the p parts of V (K(n, p)), then a holey k-factor of deficiency Vi of K(n, p) is a k-factor of K(n, p)− Vi for some i satisfying 1 ≤ i ≤ p. Hence a holey k-factorization is a set of...
متن کاملFactorizations of complete multigraphs
In this paper, several general results are obtained on the Oberwolfach problem that provide isomorphic 2-factorizations of 2Kn. One consequence of these results is that the existence of a 2-factorization in which each 2-factor of 2Kn consists of one cycle of length x and one of length n-x is completely settled. The techniques used to obtain these results are novel, using for example the Lindner...
متن کاملNew infinite classes of 1-factorizations of complete graphs
Some classes of I-factorizations of complete graphs are known. They are GK2n , AK2n , W K 2n and their variations, and automorphism-free I-factorizations. In this paper, for any positive integer t, we construct new I-factorizations NtK 2n which are defined for all 2n with 2n ~ 6t. They also have some variations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90262-z